Optimal Size Integer Division Circuits
نویسندگان
چکیده
منابع مشابه
Waist-size Optimal Parallel Prefix Circuits
A class of parallel algorithms solving the prefix problem on the circuit model are presented. These prefix circuits are problem-size independent, and can be faster than other prefix circuits when the problem size is greater than the circuit width. The prefix circuits are compared analytically with other prefix circuits to show how fast they are.
متن کاملSoftware Integer Division
Early computers omitted instructions for integer multiplication and division, requiring these operations to be synthesized in software. Even some modern RISC and DSP architectures are deficient in the case of division. Therefore software methods for performing integer division continue to be of interest. We consider typical architectures based on two’s complement binary arithmetic and present v...
متن کاملInteger division using reciprocals
As logic density increases, more and more functionality is moving into hardware. Several years ago, it was uncommon to nd more than minimal support in a processor for integer multiplication and division. Now, several processors have multipliers included within the central processing unit on one integrated circuit [8, 12]. Integer division, due to its iterative nature, bene ts much less when imp...
متن کاملBidirectional Exact Integer Division
Division of integers is called exact if the remainder is zero. We show that the high-order part and the low-order part of the exact quotient can be computed independently from each other. A sequential implementation of this algorithm is up to twice as fast as ordinary exact division and four times as fast as the general classical division algorithm if the dividend is twice as long as the diviso...
متن کاملPrescaled Integer Division
We describe a high radix integer division algorithm where the divisor is prescaled and the quotient is postscaled without modifying the dividend to obtain an identity with the quotient differing from the desired integer quotient only in its lowest order high radix digit. Here the “oversized” partial remainder is bounded by the scaled divisor with at most one additional high radix digit selectio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1990
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0219064